The _yyyy_aaaa_cccc_cccc command converts a context-free grammar into a set of tables for
a simple automaton that executes an LALR(1) parsing algorithm. The
grammar may be ambiguous; specified precedence rules are used to break
ambiguities. _yyyy_aaaa_cccc_cccc processes supplementary code set characters in program
comments and strings, and single-byte supplementary code set characters
in tokens, according to the locale specified in the _LLLL_CCCC______CCCC_TTTT_YYYY_PPPP_EEEE environment
variable [see _LLLL_AAAA_NNNN_GGGG on _eeee_nnnn_vvvv_iiii_rrrr_oooo_nnnn(5)].
The output file, _yyyy_...._tttt_aaaa_bbbb_...._cccc, must be compiled by the C compiler to produce a
program _yyyy_yyyy_pppp_aaaa_rrrr_ssss_eeee. This program must be loaded with the lexical analyzer
program, _yyyy_yyyy_llll_eeee_xxxx, as well as _mmmm_aaaa_iiii_nnnn and _yyyy_yyyy_eeee_rrrr_rrrr_oooo_rrrr, an error handling routine.
These routines may be supplied by the user; the _llll_eeee_xxxx(1) command is useful
for creating lexical analyzers usable by _yyyy_aaaa_cccc_cccc. A simple _mmmm_aaaa_iiii_nnnn and _yyyy_yyyy_eeee_rrrr_rrrr_oooo_rrrr
are available in _llll_iiii_bbbb_yyyy. The _yyyy_yyyy_eeee_rrrr_rrrr_oooo_rrrr routine in _llll_iiii_bbbb_yyyy_...._aaaa has the following
signature: _iiii_nnnn_tttt _yyyy_yyyy_eeee_rrrr_rrrr_oooo_rrrr_((((_cccc_oooo_nnnn_ssss_tttt _cccc_hhhh_aaaa_rrrr _****_)))). If a user wishes to have a
_yyyy_yyyy_eeee_rrrr_rrrr_oooo_rrrr with a different signature, they must define the symbol
___________mmmm_yyyy______yyyy_yyyy_eeee_rrrr_rrrr_oooo_rrrr at the top of their _...._yyyy file.
_----_vvvv Prepares the file _yyyy_...._oooo_uuuu_tttt_pppp_uuuu_tttt, which contains a description of the
parsing tables and a report on conflicts generated by